Using cyclic corrective codes in recurrent code scales
نویسندگان
چکیده
منابع مشابه
Sensory neural codes using multiplexed temporal scales.
Determining how neuronal activity represents sensory information is central for understanding perception. Recent work shows that neural responses at different timescales can encode different stimulus attributes, resulting in a temporal multiplexing of sensory information. Multiplexing increases the encoding capacity of neural responses, enables disambiguation of stimuli that cannot be discrimin...
متن کاملEfficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases
This paper revisits the topic of decoding cyclic codes with Gröbner bases. We introduce new algebraic systems, for which the Gröbner basis computation is easier. We show that formal decoding formulas are too huge to be useful, and that the most efficient technique seems to be to recompute a Gröbner basis for each word (online decoding). We use new Gröbner basis algorithms and “trace preprocessi...
متن کاملA Multi-dimensional Code-division-multiplexed Ofdma Modem Using Cyclic Rotated Orthogonal Complete Complementary Codes
In this paper we present a novel multiple access scheme based on a combination of of Electrical, Electronic & Computer Engineering, Corner of University Road and Lynnwood , E-mail: [email protected], [email protected] * and L.P. Linde** Abstract: In this paper we present a novel multiple access scheme based on a combination of multi-carrier OFDMA techniques and a multi-dimensional spread spe...
متن کاملCode-Based Cryptosystems Using Generalized Concatenated Codes
Public-key cryptosystems nowadays are mostly based on number theoretic problems like factorization (RSA) and the discrete logarithm problem (Elgamal). However, such systems can be broken with quantum computers by applying Shor’s algorithms [1] for solving both problems, factorization and discrete logarithm, in polynomial time. Hence there is a need for post-quantum cryptography, i.e., methods r...
متن کاملA new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Izvestiâ vysših učebnyh zavedenij. Priborostroenie
سال: 2017
ISSN: 0021-3454
DOI: 10.17586/0021-3454-2017-60-10-973-979